Iterated Class Forcing
نویسنده
چکیده
In this paper we develop the notion of \stratiied" class forcing and show that this property both implies coonality-preservation and is preserved by iterations with the appropriate support. Many Easton-style and Jensen-style forcings are stratiied, as are some more exotic forcings obtained by mixing these types together (see Easton 70], section 36 of Jech 78], Beller-Jensen-Welch 82], Friedman 90]). As a sample application, coonalities are preserved by an iteration of length ORD where at even stages i, an Easton-style forcing adds a Cohen set to regular cardinals card (i), at odd stages i + 1 the class added at stage i is coded by a subset of the least innnite regular cardinal card(i) via the techniques of Friedman 94A] or Friedman 94B], and for any regular , fijp(i) is nontrivial below g is a subset of + of size < , for each condition p in the iteration. Jensen coding as in Beller-Jensen-Welch 82] is not stratiied but obeys a related property, called-stratiication, which is also preserved by iterations with the appropriate (larger) support. As a sample application, the original form of Jensen coding can be used in the iteration of the preceding paragraph, provided the Cohen sets are added at successor cardinals only, full support is used and the condition stated at the end of that paragraph is imposed only at successor cardinals. We now deene stratiication, in the language of GG odel-Bernays class theory. Deenition P (partially ordered by) is stratiied if there is a class A such that V = LA], hV; Ai has a-deenable well ordering and: (a) P and are A-deenable. A condition in P is a function p on an initial segment of Card = f0gg Innnite Cardinals, where if q extends p as a function, q() = ; for all 2 Dom(q) ? Dom(p), then we identify p with q. Also we require that p() = ; for singular and the conditions with constant value ; are the weakest in P. Lastly, fpjp + 2 H + g is dense for each 2 Card. (b) (Density Reduction) Let be regular and deene p q if (p q and p
منابع مشابه
The Exact Strength of the Class Forcing Theorem
The class forcing theorem, which asserts that every class forcing notion P admits a forcing relation P, that is, a relation satisfying the forcing relation recursion—it follows that statements true in the corresponding forcing extensions are forced and forced statements are true—is equivalent over Gödel-Bernays set theory GBC to the principle of elementary transfinite recursion ETROrd for class...
متن کاملConsistency Strengths of Modified Maximality Principles
The Maximality Principle mp is a scheme which states that if a sentence of the language of zfc is true in some forcing extension V , and remains true in any further forcing extension of V , then it is true in all forcing extensions of V . A modified maximality principle mpΓ arises when considering forcing with a particular class Γ of forcing notions. A parametrized form of such a principle, mpΓ...
متن کاملZero forcing in iterated line digraphs
Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line digraphs are frequently used as models. Zero forcing is also related to power domination, a propagation process that models the monitoring of electric...
متن کاملFractal Dual Substitution Tilings
Starting with a substitution tiling, we demonstrate a method for constructing infinitely many new substitution tilings. Each of these new tilings is derived from a graph iterated function system and the tiles have fractal boundary. We show that each of the new tilings is mutually locally derivable to the original tiling. Thus, at the tiling space level, the new substitution rules are expressing...
متن کاملA boolean algebraic approach to semiproper iterations
These notes present a compact and self contained development of the theory of iterated forcing with a focus on semiproperness and revised countable support iterations. We shall pursue the approach to iterated forcing devised by Donder and Fuchs in [4], thus we shall present iterated forcing by means of directed system of complete and injective homomorphisms of complete boolean algebras. A guidi...
متن کاملController Placement in Software Defined Network using Iterated Local Search
Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993